Diffie–Hellman problem - PDFSEARCH.IO - Document Search Engine

Diffie–Hellman problem
Results: 86

#	Item
41	VME Cell TM VME Cell combines three layers of security in order to provide a completely secured Connection: Add to Reading List Source URL: www.meganet.com Language: English - Date: 2014-10-24 18:00:57 Key size Whitfield Diffie Public-key cryptography Key-agreement protocol Advanced Encryption Standard Diffie–Hellman problem Index of cryptography articles Cryptography Cryptographic protocols Diffie–Hellman key exchange
42	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-05-13 22:32:41 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
43	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-01-05 20:38:47 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
44	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-01-05 17:05:04 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
45	A Signature Scheme as Secure as the Diffie-Hellman Problem Eu-Jin Goh and StanisÃlaw Jarecki Computer Science Department, Stanford University, Stanford CA[removed]removed], [removed] Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:52 Computational hardness assumptions BLS Schnorr signature Forking lemma Digital signature XTR ElGamal encryption Random oracle Diffie–Hellman problem Cryptography Public-key cryptography Finite fields
46	DELARAM KAHROBAEI, City University of New York, City Tech and Graduate Center Public key exchange using extensions by endomorphisms and matrices over a Galois field I am presenting a joint work with H.T.Lam and V.Shpilra Add to Reading List Source URL: cms.math.ca Language: English - Date: 2013-11-01 09:18:01 Diffie–Hellman key exchange Hellman Whitfield Diffie Public-key cryptography Finite field Key exchange Cryptography Cryptographic protocols Diffie–Hellman problem
47	Pairing-Based Cryptographic Protocols : A Survey Ratna Dutta, Rana Barua and Palash Sarkar Cryptology Research Group Stat-Math and Applied Statistics Unit 203, B. T. Road, Kolkata India[removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-06-24 08:19:14 Digital signature Diffie–Hellman problem Signcryption Group signature Blind signature ID-based encryption RSA Pairing Diffie–Hellman key exchange Cryptography BLS Decisional Diffie–Hellman assumption
48	Initiator-Resilient Universally Composable Key Exchange Dennis Hofheinz, J¨orn M¨ uller-Quade, and Rainer Steinwandt IAKS, Arbeitsgruppe Systemsicherheit, Prof. Dr. Th. Beth, Fakult¨ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-25 06:20:23 Diffie–Hellman key exchange Public-key cryptography Diffie–Hellman problem Decisional Diffie–Hellman assumption XTR Internet Key Exchange Commitment scheme Cryptography Cryptographic protocols Universal composability
49	An Introduction to Pairing-Based Cryptography Alfred Menezes Abstract. Bilinear pairings have been used to design ingenious protocols for such tasks as one-round three-party key agreement, identity-based encryption, and Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2013-10-27 06:53:30 Pairing Boneh/Franklin scheme Elliptic curve cryptography Diffie–Hellman problem Elliptic curve ID-based encryption Tate pairing BLS Supersingular elliptic curve Cryptography Abstract algebra Algebra
50	ANOTHER LOOK AT NON-STANDARD DISCRETE LOG AND DIFFIE-HELLMAN PROBLEMS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We examine several versions of the one-more-discrete-log and one-more-Diffie-Hellman problems. In attempting Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-09-21 19:02:16 Finite fields Computational hardness assumptions Cryptographic protocols Group theory Diffie–Hellman problem XTR Index calculus algorithm Diffie–Hellman key exchange Random oracle Cryptography Abstract algebra Mathematics

UPDATE